On strongly 2-multiplicative graphs

A note on strongly multiplicative graphs

In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicative graph of order n, which is sharper than the upper bound obtained by Beineke and Hegde [1].

On multiplicative Zagreb indices of graphs

Todeschini et al. have recently suggested to consider multiplicative variants of additive graph invariants, which applied to the Zagreb indices would lead to the multiplicative Zagreb indices of a graph G, denoted by ( ) 1  G and ( ) 2  G , under the name first and second multiplicative Zagreb index, respectively. These are define as     ( ) 2 1 ( ) ( ) v V G G G d v and ( ) ( ) ( ) ( ) 2...

A Note on Strongly Quotient Graphs

Strongly Multiplicative Labeling of Some Snake Related Graphs

Abstract: A graph G with p vertices is said to be strongly multiplicative if the vertices of G can be labeled with p consecutive positive integers 1, 2, ..., p such that label induced on the edges by the product of labels of end vertices are all distinct. In this paper we investigate strongly multiplicative labeling of some snake related graphs. We prove that alternate triangular snake and alte...

on multiplicative zagreb indices of graphs

todeschini et al. have recently suggested to consider multiplicative variants of additive graphinvariants, which applied to the zagreb indices would lead to the multiplicative zagrebindices of a graph g, denoted by ( ) 1  g and ( ) 2  g , under the name first and secondmultiplicative zagreb index, respectively. these are define as  ( )21 ( ) ( )v v gg g d vand ( ) ( ) ( )( )2 g d v d v gu...

The Maximum Number of Edges in a Strongly Multiplicative Graph